ParLPG: Generating Domain-Specific Planners through Automatic Parameter Configuration in LPG
نویسندگان
چکیده
The ParLPG planning system is based on the idea of using a generic algorithm configuration procedure – here, the well-known ParamILS framework – to optimise the performance of a highly parametric planner on a set of problem instances representative of a specific planning domain. This idea is applied to LPG, a versatile and efficient planner based on stochastic local-search with 62 parameters and over 6.5 × 10 possible configurations. A recent, largescale empirical investigation showed that the approach behind ParLPG yields substantial performance improvements across a broad range of planning domains.
منابع مشابه
Configuration and Learning Techniques for Efficient Automated Planning Systems
In this abstract we briefly present our thesis work, which is focused on three main directions: (i) speeding-up optimal SAT-based planners by exploiting learned domain knowledge, (ii) configuring a portfolio of planners for an input domain, and (iii) the automated configuration of planning algorithms. The main results of such a work are three planning systems: MacroSatPlan (Gerevini, Saetti & V...
متن کاملGenerating Fast Domain-Specific Planners by Automatically Configuring a Generic Parameterised Planner
When designing state-of-the-art, domain-independent planning systems, many decisions have to be made with respect to the domain analysis or compilation performed during preprocessing, the heuristic functions used during search, and other features of the search algorithm. These design decisions can have a large impact on the performance of the resulting planner. By providing many alternatives fo...
متن کاملGenerating Fast Domain-Optimized Planners by Automatically Configuring a Generic Parameterised Planner
When designing state-of-the-art, domain-independent planning systems, many decisions have to be made with respect to the domain analysis or compilation performed during preprocessing, the heuristic functions used during search, and other features of the search algorithm. These design decisions can have a large impact on the performance of the resulting planner. By providing many alternatives fo...
متن کاملAutomatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners
When designing state-of-the-art, domain-independent planning systems, many decisions have to be made with respect to the domain analysis or compilation performed during preprocessing, the heuristic functions used during search, and other features of the search algorithm. These design decisions can have a large impact on the performance of the resulting planner. By providing many alternatives fo...
متن کاملAutomatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners. In: 18th RCRA workshop on Experimental Evaluation of Algorithms for Solving
When designing state-of-the-art, domain-independent planning systems, many decisions have to be made with respect to the domain analysis or compilation performed during preprocessing, the heuristic functions used during search, and other features of the search algorithm. These design decisions can have a large impact on the performance of the resulting planner. By providing many alternatives fo...
متن کامل